xBSP: An Efficient BSP Implementation for clan

نویسندگان

  • Yang-Suk Kee
  • Soonhoi Ha
چکیده

Virtual Interface Architecture(VIA) is a light-weight protocol for protected user-level zero-copy communication. In spite of high performance of VIA, the previous MPI implementation for GigaNet’s cLAN revealed low communication performance. The main sources of the low performance are the discrepancy of communication model between MPI and VIA and multi-threading overhead. In this paper, we propose a new implementation of the Bulk Synchronous Parallel(BSP) programming library for VIA called xBSP overcoming such problems. To our best knowledge, xBSP is the first implementation of the BSP library for VIA. xBSP demonstrates that selecting a proper library is important to exploit the features of light-weight protocols. The intensive use of RDMA operation leads to high performance close to the native VIA performance with respect to round trip delay and bandwidth. Based on the study of the effects of multithreading, memory registration, and completion policy on performance, we could obtain an efficient BSP implementation for cLAN, which is confirmed by experimental results.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Implementation of the BSP Programming Library for VIA

Virtual Interface Architecture(VIA) is a light-weight protocol for protected user-level zero-copy communication. In spite of the promised high performance of VIA, previous MPI implementations for GigaNet’s cLAN revealed low communication performance. Two main sources of such low performance are the discrepancy in the communication model between MPI and VIA and the multi-threading overhead. In t...

متن کامل

Experimental Evaluation of BSP Programming Libraries

The model of bulk-synchronous parallel computation (BSP) helps to implement portable general purpose algorithms while keeping predictable performance on different parallel computers. Nevertheless, when programming in ‘BSP style’, the running time of the implementation of an algorithm can be very dependent on the underlying communications library. In this study, an overview of existing approache...

متن کامل

An ethnographic study of information needs and practices of nomadic people of Babadi Clan of Bakhtiari tribe

Background and aim: the aim was to study information needs and practices of nomadic people of Babadi clan of Bakhtiari tribe. Methods: the study uses ethnography as method and uses observation and semi-structured interview as data collection techniques. Results: life style increasingly influences and directs the way nomadic people look for information. They prefer informal information resource...

متن کامل

Constructive Solid Geometry Using BSP Tree

Constructive solid geometry (CSG) is a pivotal component of CAD and CAE packages. CSG allows us to represent complex shapes and models as a series of Boolean operations between primitives. For example, punching a hole through a cube would be difficult to represent with an implict or explicit funciton. The CSG algorithm we have developed allows something like this to be represented as a simple B...

متن کامل

Truly Efficient Parallel Algorithms: 1-optimal Multisearch for an Extension of the BSP Model

In this paper we design and analyse parallel algorithms with the goal to get exact bounds on their speed-ups on real machines. For this purpose we deene an extension of Valiant's BSP model, BSP*, that rewards blockwise communication, and use Valiant's notion of 1-optimality. Intuitively, a 1-optimal parallel algorithm for p processors achieves speed-up close to p. We consider the Multisearch Pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001